Synthesis and FPGA-based Implementation of Hierarchical Finite State Machines from Specification in Handel-C

نویسنده

  • VALERY SKLYAROV
چکیده

The paper suggests a technique, which permits to describe modular, hierarchical and parallel algorithms in Handel-C. This opportunity has been provided by generating the required control sequences with the aid of a hierarchical finite state machine. The proposed specification in Handel-C is synthesizable and it can be translated (for example, in DK2 environment of Celoxica) to EDIF format. The latter can be converted to a bit-stream for commercially available FPGAs. An example of sorting procedure was described in detail and implemented in Xilinx Spartan II XC2S200 FPGA available on Celoxica RC100 prototyping board. Key-Words – hierarchical finite state machines, system-level specification, Handel-C, FPGA

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of FPGA based Firewall Using Behavioral Synthesis

Behavioral design helps the designer to understand the design space and subsequently coming up with a design that meets all the constraints specifically in a field programmable gate array (FPGA) based design paradigm. In this paper we have reported a novel design framework for creation of behavioral design. We have examined the opportunities brought about by finite state machines and to harness...

متن کامل

Implementation of Recursive Search Algorithms in Reconfigurable Hardware

By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. A great deal of research effort in this area is aimed at accelerating the solution of combinatorial optimization problems. However, hardware description languages (such as VHDL) as well as system-level specification languages (such as Han...

متن کامل

Formal Behavioural Synthesis of Handel-C Parallel Hardware Implementations from Functional Specifications

Enormous improvements in efficiency can be achieved through exploiting parallelism and realizing implementation in hardware. On the other hand, conventional methods for achieving these improvements are traditionally costly, complex and error prone. Two significant advances in the past decade have radically changed these perceptions. Firstly, the FPGA, which gives us the ability to reconfigure h...

متن کامل

Synthesis of a Parallel Jpeg Decoder from a Functional Specification

Given the recent emergence of cheap reconfigurable hardware, such as the FPGA, it is now possible to obtain reconfigurable circuits with upwards of one hundred million gates. Although we have such enormously powerful hardware at our fingertips, we are still somewhat lacking in techniques to properly exploit this technology to its full potential. We propose a development strategy commencing with...

متن کامل

Modelling and FPGA-based Implementation of Graph Colouring Algorithms

The paper discusses an effective matrix-based exact algorithm for graph colouring that is well-suited for implementation in FPGA. It is shown that the algorithm can also be used as a base for a number of approximate algorithms. Software models (described in C++) and hardware circuits (synthesised from Handel-C specifications) for the exact algorithm are discussed, analysed and compared. Charact...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004